Optimal Variable Selection and Adaptive Noisy Compressed Sensing

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Compressed Sensing MRI

INTRODUCTION Most of the prior work in compressed sensing MRI has been based on pre-defined transformations to sparsify image representations, e.g. discrete cosine transforms (DCT), wavelets, and finite differences [1]. Even though an analytical transformation usually features a fast implementation, its performance as a sparsifying transform is limited by the underlying basis functions, which t...

متن کامل

Non-Convex Compressed Sensing from Noisy Measurements

This paper proposes solution to the following non-convex optimization problem: min || x || p subject to || y Ax || q Such an optimization problem arises in a rapidly advancing branch of signal processing called ‘Compressed Sensing’ (CS). The problem of CS is to reconstruct a k-sparse vector xnX1, from noisy measurements y = Ax+ , where AmXn (m<n) is the measurement matrix and mX1 is additive no...

متن کامل

Adaptive Distributed Compressed Video Sensing

Compressed sensing is a state-of-the-art technology which can significantly reduce the number of sampled data in sparse signal acquisition. This paper studies the distributed compressed sensing (DISCOS) of video signals. To this end, we propose adaptive adjustments to the block-based (local) measurement rate, the frame-based (global) measurement rate, and the sparse dictionary size, thus formin...

متن کامل

Adaptive Robust Variable Selection.

Heavy-tailed high-dimensional data are commonly encountered in various scientific fields and pose great challenges to modern statistical analysis. A natural procedure to address this problem is to use penalized quantile regression with weighted L1-penalty, called weighted robust Lasso (WR-Lasso), in which weights are introduced to ameliorate the bias problem induced by the L1-penalty. In the ul...

متن کامل

Near-optimal Binary Compressed Sensing Matrix

Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix. Recently several zero-one binary sensing matrices have been deterministically constructed for their relative low complexity and competitive performance. Considerin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2020

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2020.2965738